Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach
نویسندگان
چکیده
منابع مشابه
A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equi...
متن کاملCompressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quantification analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several compressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that ar...
متن کاملPost-Maneuver Collision Probability Estimation Using Sparse Polynomial Chaos Expansions
This paper describes the use of polynomial chaos expansions to approximate the probability of a collision between two satellites after at least one performs a translation maneuver. Polynomial chaos provides a computationally efficient means to generate an approximate solution to a stochastic differential equation without introducing any assumptions on the a posteriori distribution. The stochast...
متن کاملpolynomial chaos expansions KEVIN
Submitted for the MAR13 Meeting of The American Physical Society Simulation of stochastic quantum systems using polynomial chaos expansions KEVIN YOUNG, MATTHEW GRACE, Sandia National Laboratories — We present an approach to the simulation of quantum systems driven by classical stochastic processes that is based on the polynomial chaos expansion, a well-known technique in the field of uncertain...
متن کاملSAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Research
سال: 2020
ISSN: 1674-5647,2707-8523
DOI: 10.4208/cmr.2020-0010